The Periodic Joint Replenishment Problem is Strongly NP-Hard
نویسندگان
چکیده
In this paper we study the long-standing open question regarding the computational complexity of one of the core problems in supply chains management, the periodic joint replenishment problem. This problem has received a lot of attention over the years and many heuristic and approximation algorithms were suggested. However, in spite of the vast effort, the complexity of the problem remained unresolved. In this paper, we provide a proof that the problem is indeed strongly N P-hard.
منابع مشابه
The joint replenishment problem involving multiple suppliers offering quantity discounts
In this article, we deal with the problem of determining the economic operating policy when a number of items are to be procured from a number of suppliers offering different quantity discounts schedules. In such inventory problems, a fixed cost is incurred with each replenishment order, independent of the suppliers as well as the items involved in the order. Further, the item involves a minor ...
متن کاملApproximating the Joint replenishment Problem with Deadlines
The objective of the classical Joint Replenishment Problem (JRP) is to minimize ordering costs by combining orders in two stages, first at some retailers, and then at a warehouse. These orders are needed to satisfy demands that appear over time at the retailers. We investigate the natural special case that each demand has a deadline until when it needs to be satisfied. For this case, we present...
متن کاملVendor Managed Inventory of a Single-vendor Multiple-retailer Single-warehouse Supply Chain under Stochastic Demands
In this study, a vendor-managed inventory model is developed for a single-vendor multiple-retailer single-warehouse (SV-MR-SV) supply chain problem based on the economic order quantity in which demands are stochastic and follow a uniform probability distribution. In order to reduce holding costs and to help balanced on-hand inventory cost between the vendor and the retailers, it is assumed that...
متن کاملStaggering Periodic Replenishment in Multivendor JIT Environments
The delivery scheduling problem studied in this paper was motivated by the operation in a large personal computer assembly plant, which was using multisourcing for some of its materials. The company’s objective was to design a delivery schedule so that the average inventory level in the factory was minimized. We show that the problem is intimately related to a classical inventory staggering pro...
متن کاملOptimal ordering quantities for substitutable deteriorating items under joint replenishment with cost of substitution
In this paper we develop an inventory model, to determine the optimal ordering quantities, for a set of two substitutable deteriorating items. In this inventory model the inventory level of both items depleted due to demands and deterioration and when an item is out of stock, its demands are partially fulfilled by the other item and all unsatisfied demand is lost. Each substituted item incurs a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1511.02454 شماره
صفحات -
تاریخ انتشار 2015